Conversion of Finite Automata to Fuzzy Automata for string comparison
نویسندگان
چکیده
منابع مشابه
Multidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملAdjusting fuzzy automata for string similarity measuring
In this paper1, we introduce a fuzzy automaton for computing the similarity between pairs of strings and a genetic method for adjusting its parameters. The fuzzy automaton models the edit operations needed to transform any string into another one. The selection of appropriate fuzzy operations and fuzzy membership values for the transitions leads to improve the system performance for a particula...
متن کاملBifuzzy core of fuzzy automata
The purpose of the present work is to introduce the concept of bifuzzy core of a fuzzy automaton, which induces a bifuzzy topology on the state-set of this fuzzy automaton. This is shown that this bifuzzy topology can be used to characterize the concepts such as bifuzzy family of submachines, bifuzzy separable family and bifuzzy retrievable family of a fuzzy automaton.
متن کاملBipolar general fuzzy automata
In this paper, we define the notion of a bipolar general fuzzy automaton, then we construct some closure operators on the set of states of a bipolar general fuzzy automaton. Also, we construct some topologies on the set of states of a bipolar general fuzzy automaton. Then we obtain some relationships between them.
متن کاملApproximate String Matching by Fuzzy Automata
We explain new ways of constructing search algorithms using fuzzy sets and fuzzy automata. This technique can be used to search or match strings in special cases when some pairs of symbols are more similar to each other than the others. This kind of similarity can’t be handled by usual searching algorithms. We present sample situations, which would use this kind of searching. Then we define a f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/4625-6647